An Algebraic Sparsified Nested Dissection Algorithm Using Low-Rank Approximations
نویسندگان
چکیده
منابع مشابه
Generalized Low-Rank Approximations
We study the frequent problem of approximating a target matrix with a matrix of lower rank. We provide a simple and efficient (EM) algorithm for solving weighted low rank approximation problems, which, unlike simple matrix factorization problems, do not admit a closed form solution in general. We analyze, in addition, the nature of locally optimal solutions that arise in this context, demonstra...
متن کاملWeighted Low-Rank Approximations
We study the common problem of approximating a target matrix with a matrix of lower rank. We provide a simple and efficient (EM) algorithm for solving weighted low-rank approximation problems, which, unlike their unweighted version, do not admit a closedform solution in general. We analyze, in addition, the nature of locally optimal solutions that arise in this context, demonstrate the utility ...
متن کاملA Rank Revealing Randomized Singular Value Decomposition (R3SVD) Algorithm for Low-rank Matrix Approximations
— In this paper, we present a Rank Revealing Randomized Singular Value Decomposition (R 3 SVD) algorithm to incrementally construct a low-rank approximation of a potentially large matrix while adaptively estimating the appropriate rank that can capture most of the actions of the matrix. Starting from a low-rank approximation with an initial guessed rank, R 3 SVD adopts an orthogonal Gaussian sa...
متن کاملAn Efficient Gauss-Newton Algorithm for Symmetric Low-Rank Product Matrix Approximations
Abstract. We derive and study a Gauss-Newton method for computing a symmetric low-rank product XXT, where X ∈ Rn×k for k < n, that is the closest to a given symmetric matrix A ∈ Rn×n in Frobenius norm. When A = BTB (or BBT), this problem essentially reduces to finding a truncated singular value decomposition of B. Our Gauss-Newton method, which has a particularly simple form, shares the same or...
متن کاملA Cartesian Parallel Nested Dissection Algorithm
shop on Sparse Matrix Computations: Graph Theory Issues and Algorithms, Institute for Mathematics and Its Applications, Springer-Verlag, 1992. [13] G. L. Miller, S. Teng, and S. A. Vavasis, A uni ed geometric approach to graph separators, in Proceedings of the 32nd Annual Symposiumon Foundations of Computer Science, IEEE, 1991, pp. 538{547. [14] G. L. Miller and W. Thurston, Separators in two a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Matrix Analysis and Applications
سال: 2020
ISSN: 0895-4798,1095-7162
DOI: 10.1137/19m123806x